Dynamics of Algorithmic Processing in Computer Systems

This paper presents a new analytical and experimental approach to the insertion sort algorithm and task processing dynamics. The dependencies that exist in the task structure can influence the algorithm’s behavior, especially in the number of dominant operations that are needed to compute the computational complexity. The proposed approach is based on a Tsallis definition of entropy suitable for all systems that are far from thermodynamical equilibrium. The ideas presented show how a complex systems approach can provide a good perspective for analyzing the processing dynamics of computer systems that are no longer simple.